-
1 reducible polynomial
приведенный полином
приводимый полином
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
Синонимы
EN
приводимый полином
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > reducible polynomial
-
2 reducible polynomial
nCOMP&DP polinomio reducible m -
3 reducible polynomial
Большой англо-русский и русско-английский словарь > reducible polynomial
-
4 reducible polynomial
1) Математика: приводимый многочлен2) Вычислительная техника: приводимый полином -
5 reducible polynomial
• reduktibilan polinom -
6 reducible polynomial
мат.English-Russian scientific dictionary > reducible polynomial
-
7 reducible polynomial
English-Russian information technology > reducible polynomial
-
8 reducible
-
9 приводимый многочлен
Большой англо-русский и русско-английский словарь > приводимый многочлен
-
10 algebra
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
algebra with maximality condition — алгебра с условием максимальности, алгебра с условием обрыва возрастающих цепей
-
11 ring
1) кольцо2) окружность; круг3) звон || звонить; звенеть4) кольцевая область; кольцо || кольцевой6) обруч || надевать обруч7) обод; фланец; обойма8) ободок9) телефон. звонок; вызов || посылать вызов10) вчт счётное кольцо; кольцевая схема11) тор12) фланец; хомут; бугель13) ядро•ring over field — мат. кольцо над полем
ring with cancellation — мат. кольцо без делителей нуля
ring with divided powers — мат. кольцо с разделёнными степенями
ring with division — мат. кольцо с делением
ring with divisors of zero — мат. кольцо с делителями нуля
ring with filtration — мат. кольцо с фильтрацией, фильтрованное кольцо
ring with identity — мат. кольцо с единицей
ring with involution — мат. кольцо с инволюцией
ring with maximum condition — мат. кольцо с условием максимальности
ring with minimum condition — мат. кольцо с условием минимальности
ring with operators — мат. кольцо с операторами, операторное кольцо
ring with unit element — мат. кольцо с единицей
ring with unity — мат. кольцо с единицей
ring without divisors of zero — мат. кольцо без делителей нуля
ring without identity — мат. кольцо без единицы
- absolutely flat ring - analytically normal ring - analytically unramified ring - completely reducible ringring without radical — мат. кольцо без радикала
- eye ring- flat cohomology ring - fully primary ring - lattice ordered ring - left hereditary ring - locally decomposable ring - locally factorial ring - locally matrix ring - locally nilpotent ring - locally polynomial ring- mud ring- nil ring- nilpotent ring - projectively trivial ring- rim ring- ring of analytical functions - ring of formal power series - ring of linear transformations - ring of principal ideals - ring of vector functions- ring off- top ring- total quotient ring - totally primary ring - totally reducible ring - weakly regular ring -
12 representation
1) изображение2) отображение; представление•- completely irreducible representation - completely reduced representation - completely reducible representation - discrete representation - finitely related representation - identity representation - locally constant representation - locally faithful representation - strongly rational representation - totally reducible representation -
13 module
1) модуль || разбивать на модули2) блок, узел3) коэффициент4) строит. модульная секция•module in space — мат. модуль в пространстве
module on space — мат. модуль на пространстве
module with differentiation — мат. дифференциальный модуль, модуль с дифференциалом
module with filtration — мат. модуль с фильтрацией
module without torsion — мат. модуль без кручения
-
14 matrix
1) мат. матрица || матричный2) форма, шаблон4) растр5) решётка6) таблица7) геол. материнская порода, основная масса ( породы)8) основа кристаллического вещества; кристаллическая решётка•- absolutely equivalent matrices - adjoint matrices - almost perfect matrix - almost periodic matrix - almost superdiagonal matrix - associative matrix - birth-death coefficient matrix - cocycle matrix - commutative matrix - commute matrices - commuting matrix - complex conjugate matrix - compound matrix - conjunctive matrices - consistently ordered matrix - constituent matrices - deficient matrix - doubly degenerated matrix - doubly stochastic matrix - encoding matrix - essentially positive matrix - magnetic core matrix - matrix of linear transformation - multiplicatively cogredient matrix - multiply degenerate matrix - mutually consistent matrices - nearly triangular matrix - negatively semidefinite matrix - nonnegatively semidefinite matrix - orthogonally similar matrices - positively definite matrix - positively semidefinite matrix - regularly partitioned matrix - strictly upper triangular matrix - strongly equivalent matrices - totally nonnegative matrix - totally positive matrix - totally unimodular matrix - uniformly tapered matrix - vertex incidence matrix - vertically symmetrical matrix - weakly cyclic matrix -
15 model
1) макет; модель || моделировать2) образец4) модель, тип ( изделия)5) шаблон•- countably saturated model - countably uniform model - coupled channels model - finite state model - finitely generated model - game-theory model - random trial increment model - random walk model - sampling model -
16 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
17 term
1) термин2) мат. член; терм3) элемент; составляющая4) срок5) условие (напр. контракта)6) мат. одночлен•- n-th term of expansion - totally labeled term
См. также в других словарях:
reducible polynomial — noun : a polynomial expressible as the product of two or more polynomials of lower degree … Useful english dictionary
Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… … Wikipedia
reducible — reducibility, reducibleness, n. reducibly, adv. /ri dooh seuh beuhl, dyooh /, adj. 1. capable of being reduced. 2. Math. a. of or pertaining to a polynomial that can be factored into the product of polynomials, each of lower degree. b. of or… … Universalium
Irreducible polynomial — In mathematics, the adjective irreducible means that an object cannot be expressed as a product of at least two non trivial factors in a given set. See also factorization. For any field F , the ring of polynomials with coefficients in F is… … Wikipedia
Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… … Wikipedia
приведенный полином — приводимый полином — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом Синонимы приводимый полином EN reducible polynomial … Справочник технического переводчика
приводимый полином — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN reducible polynomial … Справочник технического переводчика
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Random self-reducibility — (RSR): A good algorithm for the average case implies a good algorithm for the worst case. RSR is the ability to solve all instances of a problem by solving a large fraction of the instances.DefinitionIf a function f evaluating any instance x can… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
